Discrete - time Gauss - Markov Processes with Fixed Reciprocal Dynamics
نویسندگان
چکیده
Motivated by a problem considered earlier by Schrodinger [1]{[2], Jamison [3]{[4] and others, we examine in this paper the construction of Gauss-Markov processes with xed reciprocal dynamics. Given the class of reciprocal processes speci ed by a second-order model, a procedure is described for constructing a Markov process in the class with preassigned marginal probability densities at the end points. The problem of changing the nal density of a Gauss-Markov process while remaining in the same reciprocal class is also examined, and is interpreted in terms of an estimation problem.
منابع مشابه
Markov Processes with Fixed Reciprocal
Continuing the work started in 11], in this paper we examine the construction of Gauss-Markov processes with xed reciprocal dynamics. We show how to construct Gauss-Markov processes, de-ned on a nite interval, having xed initial and end-point densities and belonging to a given reciprocal class. The problem of changing the end-point density of a Markov process, while remaining in the same recipr...
متن کاملTelescoping Recursive Representations and Estimation of Gauss-Markov Random Fields
We present telescoping recursive representations for both continuous and discrete indexed noncausal Gauss-Markov random fields. Our recursions start at the boundary (for example, a hypersurface in R, d ≥ 1) and telescope inwards. Under appropriate conditions, the recursions for the random field are differential/difference representations driven by white noise, for which we can use standard recu...
متن کاملRecursive Estimation of Gauss-Markov Random Fields Indexed over 1-D Space
This paper presents optimal recursive estimators for vector valued Gauss-Markov random fields taking values in R and indexed by (intervals of) R or Z. These 1-D fields are often called reciprocal processes. They correspond to two point boundary value fields, i.e., they have boundary conditions given at the end points of the indexing interval. To obtain the recursive estimators, we derive two cl...
متن کاملMarkov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm
The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...
متن کاملDCT/DST and Gauss-Markov fields: conditions for equivalence
The correspondence addresses the intriguing question of which random models are equivalent to the discrete cosine transform (DCT) and discrete sine transform (DST). Common knowledge states that these transforms are asymptotically equivalent to first-order Gauss causal Markov random processes. We establish that the DCT and the DST are exactly equivalent to homogeneous one-dimensional (1-D) and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998